Topological impact of constrained fracture growth

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Topological impact of constrained fracture growth

The topology of two discrete fracture network models is compared to investigate the impact of constrained fracture growth. In the Poissonian discrete fracture network model the fractures are assigned length, position and orientation independent of all other fractures, while in the mechanical discrete fracture network model the fractures grow and the growth can be limited by the presence of othe...

متن کامل

Constrained Topological Field Theory 1

We derive a model of constrained topological gravity, a theory recently introduced by us through the twist of N=2 Liouville theory, starting from the general BRST algebra and imposing the moduli space constraint as a gauge fixing. To do this, it is necessary to introduce a formalism that allows a careful treatment of the global and the local degrees of freedom of the fields. Surprisingly, the m...

متن کامل

MULTI FRACTURE/DELAMINATION ANALYSIS OF COMPOSITES SUBJECTED TO IMPACT LOADINGS

A combined finite/ discrete element method is presented for modelling of composite specimens subjected to dynamic/impact loadings. The main task is set on developing an algorithm for simulation of potential bonding and debonding/delamination phenomena during impact or general dynamic loading conditions. In addition, full fracture analysis can also be performed. The proposed approach adopts a ge...

متن کامل

Topologically Constrained Segmentation with Topological Maps

This paper presents incremental algorithms used to compute Betti numbers with topological maps. Their implementation, as topological criterion for an existing bottom-up segmentation, is explained and results on artificial images are shown to illustrate the process.

متن کامل

A Dichotomy on Constrained Topological Sorting

We introduce the constrained topological sorting problem (CTS-problem): given a target language L and a directed acyclic graph (DAG) G with labeled vertices, determine if G has a topological sort which forms a word that belongs to L. This natural problem applies to several settings, including scheduling with costs or verifying concurrent programs. It also generalizes the shuffle problem of form...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Frontiers in Physics

سال: 2015

ISSN: 2296-424X

DOI: 10.3389/fphy.2015.00075